Graded Fuzzy Rules
نویسنده
چکیده
In this contribution, we will recall graded fuzzy rules introduced in [6] and explain the difference from the classical fuzzy rules. Moreover, properties of formulae, which are used to formalize the graded fuzzy rules, will be analyzed.
منابع مشابه
Generalized Implicative Model of a Fuzzy Rule Base and its Properties
In this contribution, an implicative variant of the conjunctive normal form will be recalled and further studied. This normal form is an alternative to the Perfilieva’s conjunctive normal form. It will be shown that it is a suitable model for a particular case of graded fuzzy rules introduced as a generalization of classical fuzzy rules. Moreover, approximation properties of the implicative var...
متن کاملOn approximate reasoning with graded rules
This contribution presents a comprehensive view on problems of approximate reasoning with imprecise knowledge in the form of a collection of fuzzy IF-THEN rules formalized by approximating formulas of a special type. Two alternatives that follow from the dual character of approximating formulas are developed in parallel. The link to the theory of fuzzy control systems is also explained.
متن کاملA Mass Assignment Approach to Granular Association Rules for Multiple Taxonomies
The use of hierarchical taxonomies to organise information (or sets of objects) is a common approach for the semantic web and elsewhere, and is based on progressively finer granulations of objects. In many cases, seemingly crisp granulation disguises the fact that categories are based on loosely defined concepts which are better modelled by allowing graded membership. A related problem arises w...
متن کاملGraded consequence revisited
In this paper some basic aspects of the theory of graded consequence are reconsidered, based on many results that appeared since the inception of graded consequences in 1986. Relationships of the notion of graded consequence with the notions of consequence in many-valued and fuzzy logics are discussed. Following this, a detailed study is carried out on the necessary conditions that follow from ...
متن کاملAxiomatization of Fuzzy Attribute Logic over Complete Residuated Lattices
The paper deals with fuzzy attribute logic (FAL) and shows its completeness over all complete residuated lattices. FAL is a calculus for reasoning with if-then rules describing particular attribute dependencies in objectattribute data. Completeness is proved in two versions: classical-style completeness and graded-style completeness.
متن کامل